Multiprocessor scheduling with communication delays
نویسندگان
چکیده
Acknowledgements The work presented here has been carried out at the CWI in Amsterdam as part of the ScheduLink subproject within the Par Tool project. The ParTool project is partially supported by SPIN, a Dutch computer science stimulation program. I am truly grateful to my supervisor, Jan Karel Lenstra, and my other co-authors, Han Hoogeveen, Ben Lageweg, Steef van de Velde en Marinus Veldhorst. I have learned a lot from their expertise. Working together has been a great pleasure.
منابع مشابه
Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
Scheduling program tasks on processors is at the core of the efficient use of multiprocessor systems. Most task scheduling problems are known to be NP-Hard and, thus, heuristics are the method of choice in all but the simplest cases. The utilization of acknowledged sets of benchmark-problem instances is essential for the correct comparison and analysis of heuristics. Yet, such sets are not avai...
متن کاملScheduling in and Out Forests in the Presence of Communication Delays
We consider the problem of scheduling tasks on multiprocessor architectures in the presence of communication delays. Given a set of dependent tasks, the scheduling problem is to allocate the tasks to processors such that the pre-specified precedence constraints among the tasks are obeyed and certain cost-measures (such as the computation time) are minimized. Several cases of the scheduling prob...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملTowards the Optimal Solution of the Multiprocessor Scheduling Problem with Communication Delays
We consider the Multiprocessor Scheduling Problem with Communication Delays, where the delay is proportional to both the amount of exchanged data between pairs of dependent tasks and the distance between processors in the multiprocessor architecture. Although scheduling problems are usually solved by means of heuristics due to their large sizes, we propose methods to identify optimal solutions ...
متن کاملEnd-to-End Communication Delay Analysis in WirelessHART Networks
WirelessHART is a new standard specifically designed for real-time and reliable communication between sensor and actuator devices for industrial process monitoring and control applications. End-to-end communication delay analysis for WirelessHART networks is required to determine the schedulability of real-time data flows from sensors to actuators for the purpose of acceptance test or workload ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 16 شماره
صفحات -
تاریخ انتشار 1990